Analysis of Greedy Robot-Navigation Methods

نویسندگان

  • Apurva Mudgal
  • Craig A. Tovey
  • Sven Koenig
چکیده

Robots often have to navigate robustly despite incomplete information about the terrain or their location in the terrain. In this case, they often use greedy methods to make planning tractable. In this paper, we analyze two such robot-navigation methods. The first method is Greedy Localization, which determines the location of a robot in known terrain by always moving it to the closest location from which it will make an observation that reduces the number of its possible locations, until it has reduced that number as much as possible. We reduce the upper bound on the number of movements of Greedy Localization from O(n 3 2 ) to O(n log n) on grid graphs and thus close to the known lower bound of Ω(n log n/ log log n), where n is the number of (unblocked) vertices of the graph that discretizes the terrain. The second method is Dynamic A* (D*), which is used on several prototypes of both urban reconnaissance and planetary robots. It moves a robot in initially unknown terrain from given start coordinates to given goal coordinates by always moving the robot on a shortest presumed unblocked path from its current coordinates to the goal coordinates, pretending that unknown terrain is unblocked, until it has reached the goal coordinates or there are no more presumed unblocked paths. We reduce the upper bound on the number of movements of D* from O(n 3 2 ) to O(n log n) on arbitrary graphs and O(n log n) on planar graphs (including grid graphs) and thus close to the known lower bound of Ω(n log n/ log log n), where n is the number of (blocked and unblocked) vertices of the graph that discretizes the terrain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

Navigation Techniques of Mobile Robots In Greenhouses

With the continuous development of the industrialization process, the countries all over the world gradually appeared lack of agricultural labor force and aging phenomenon, which was especially prominent in developed countries. However the agricultural robot with high operating efficiency, high qualities of work will play an increasingly important role in future agricultural production. Robot n...

متن کامل

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

Navigation Techniques of Mobile Robots In Greenhouses

With the continuous development of the industrialization process, the countries all over the world gradually appeared lack of agricultural labor force and aging phenomenon, which was especially prominent in developed countries. However the agricultural robot with high operating efficiency, high qualities of work will play an increasingly important role in future agricultural production. Robot n...

متن کامل

Navigation of a Mobile Robot Using Virtual Potential Field and Artificial Neural Network

Mobile robot navigation is one of the basic problems in robotics. In this paper, a new approach is proposed for autonomous mobile robot navigation in an unknown environment. The proposed approach is based on learning virtual parallel paths that propel the mobile robot toward the track using a multi-layer, feed-forward neural network. For training, a human operator navigates the mobile robot in ...

متن کامل

Mobile Robot Navigation Error Handling Using an Extended Kalman Filter

Obviously navigation is one of the most complicated issues in mobile robots. Intelligent algorithms are often used for error handling in robot navigation. This Paper deals with the problem of Inertial Measurement Unit (IMU) error handling by using Extended Kalman Filter (EKF) as an Expert Algorithms. Our focus is put on the field of mobile robot navigation in the 2D environments. The main chall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004